<HTML><HEAD><TITLE>node_to_nodename(+Graph, +Node, -NodeName)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(graph_algorithms)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>node_to_nodename(+Graph, +Node, -NodeName)</H1>
Retrieves the name of a node
<DL>
<DT><EM>Graph</EM></DT>
<DD>a graph structure
</DD>
<DT><EM>Node</EM></DT>
<DD>an integer node number
</DD>
<DT><EM>NodeName</EM></DT>
<DD>ground data, usually node name
</DD>
</DL>
<H2>Description</H2>
<P>
    </P>
<H3>Modes and Determinism</H3><UL>
<LI>node_to_nodename(+, +, -) is semidet
</UL>
<H3>Fail Conditions</H3>
Fails if no node name information is available
<H2>See Also</H2>
<A HREF="../../lib/graph_algorithms/nodes_to_nodenames-3.html">nodes_to_nodenames / 3</A>, <A HREF="../../lib/graph_algorithms/nodename_to_node-3.html">nodename_to_node / 3</A>, <A HREF="../../lib/graph_algorithms/nodenames_to_nodes-3.html">nodenames_to_nodes / 3</A>
</BODY></HTML>
